#include <bits/stdc++.h>
using namespace std;

class Solution
{
  public:
    int minNumberInRotateArray(vector<int> &nums)
    {
        // write code here
        int left = 0;
        int right = nums.size() - 1;
        while (left < right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] > nums[right])
            {
                left = mid + 1;
            }
            else if (nums[mid] < nums[right])
            {
                right = mid;
            }
            else
            {
                right--;
            }
        }
        return nums[right];
    }
}; 